Complexity of parametric integration in various smoothness classes

نویسندگان

  • Thomas Daun
  • Stefan Heinrich
چکیده

We continue the complexity analysis of parametric definite and indefinite integration given by the authors in [2]. Here we consider anisotropic classes of functions, including certain classes with dominating mixed derivatives. Our analysis is based on a multilevel Monte Carlo method developed in [2] and we obtain the order of the deterministic and randomized n-th minimal errors (in some limit cases up to logarithms). Furthermore, we compare the rates in the deterministic and randomized setting to assess the gain reached by randomization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Complexity Bounds for Parametric Stochastic Itô Integration

We study the complexity of pathwise approximation of parameter dependent stochastic Itô integration for Cr functions, with r ∈ R, r > 0. Both definite and indefinite integration are considered. This complements previous results [2] for classes of functions with dominating mixed smoothness. Upper bounds are obtained by embedding of function classes and applying some generalizations of these prev...

متن کامل

Complexity of parametric initial value problems in Banach spaces

We consider initial value problems for parameter dependent ordinary differential equations with values in a Banach space and study their complexity both in the deterministic and randomized setting, for input data from various smoothness classes. We develop multilevel algorithms, investigate the convergence of their deterministic and stochastic versions, and prove lower bounds.

متن کامل

On the complexity of stochastic integration

We study the complexity of approximating stochastic integrals with error ε for various classes of functions. For Ito integration, we show that the complexity is of order ε−1, even for classes of very smooth functions. The lower bound is obtained by showing that Ito integration is not easier than Lebesgue integration in the average case setting with the Wiener measure. The upper bound is obtaine...

متن کامل

Complexity of Banach space valued and parametric stochastic Itô integration

We present a complexity analysis for strong approximation of Banach space valued and parameter dependent scalar stochastic Itô integration, driven by a Wiener process. Both definite and indefinite integration are considered. We analyze the Banach space valued version of the EulerMaruyama scheme. Based on these results, we define a multilevel algorithm for the parameter dependent stochastic inte...

متن کامل

Complexity of parametric initial value problems for systems of ODEs

We study the approximate solution of initial value problems for parameter dependent finite or infinite systems of scalar ordinary differential equations (ODEs). Both the deterministic and the randomized setting is considered, with input data from various smoothness classes. We study deterministic and Monte Carlo multilevel algorithms and derive convergence rates. Moreover, we prove their optima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Complexity

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2014